Converting Stencils to Accumulations for Communication-Avoiding Optimization in Geometric Multigrid
ثبت نشده
چکیده
This paper describes a compiler transformation on stencil operators that automatically converts a standard stencil representation into an accumulation. We use this as an enabling transformation to optimize the stencil operators in the context of Geometric Multigrid (GMG), a widely used method to solve partial differential equations. GMG has four stencil operators, the smoother, residual, restriction, and interpolation some of which require inter-process and inter-thread communication. This new optimization allows us, at each level of a GMG V-Cycle, to fuse all operators when recursing down the V-Cycle, and all smooth operations when returning up the V-Cycle. In turn, this fusion allows us to create a parallel wavefront across the fused operators that reduces communication. Thus, these combined optimizations reduce vertical (through the memory hierarchy) data movement and horizontal (inter-thread and inter-process) messages and synchronization.
منابع مشابه
Communication-Avoiding Optimization of Geometric Multigrid on GPUs
Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems in a number of different application areas. In this report, we explore communication-avoiding implementations of Geometric Multigrid on Nvidia GPUs. We achieved an overall gain of 1.2x for the whole multigrid algorithm over baseline implementation. We also provide an insight into what future ...
متن کاملImplementation and Optimization of miniGMG — a Compact Geometric Multigrid Benchmark
Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems used in a number of different application areas. In this report, we describe miniGMG, our compact geometric multigrid benchmark designed to proxy the multigrid solves found in AMR applications. We explore optimization techniques for geometric multigrid on existing and emerging multicore syste...
متن کاملA Parallel Adaptive Multigrid Method
SUMMARY A parallel version of an adaptive multigrid solver for elliptic partial diierential equations is described. It operates on a nite diierence discretization on quad-tree and oct-tree meshes, which are obtained by adaptive mesh reenement. A fast parallel load balancing strategy for the parallel multigrid equation solver is proposed that is deened by a space-lling Hilbert curve and is appli...
متن کاملNon-Galerkin Coarse Grids for Algebraic Multigrid
Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. While AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. In particular, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid h...
متن کاملA two-scale approach for efficient on-the-fly operator assembly in massively parallel high performance multigrid codes
Matrix-free finite element implementations of massively parallel geometric multigrid save memory and are often significantly faster than implementations using classical sparse matrix techniques. They are especially well suited for hierarchical hybrid grids on polyhedral domains. In the case of constant coefficients all fine grid node stencils in the interior of a coarse macro element are equal....
متن کامل